Constraint Model Elimination and a PTTP-Implementation
نویسندگان
چکیده
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constraint processing into a general, non-Horn theorem proving calculus. A framework for a new calculus is introduced which combines model elimination with constraint solving, following the lines of Bürckert (1991). A prototype system has been implemented rapidly by only combining a PROLOG technology implementation of model elimination and PROLOG with constraints. Some example studies, e.g. taxonomic reasoning, show the advantages and some problems with this procedure.
منابع مشابه
Theorem Prover : A New Exposition and Implementation in Prolog
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full rst-order predicate calculus. It di ers from Prolog in its use of uni cation with the occurs check for soundness, depthrst iterative-deepening search instead of unbounded depthrst search to make the search strategy complete, and the model elimination reduction rule that is added to Prolog inference...
متن کاملA Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full rst-order predicate calculus. It di ers from Prolog in its use of uni cation with the occurs check for soundness, depthrst iterative-deepening search instead of unbounded depthrst search to make the search strategy complete, and the model elimination reduction rule that is added to Prolog inference...
متن کاملA Flexible System for Constraint Disjunctive Logic Programming
Constraint logic programming combines Horn-clause logic and constraint reasoning. However, the specification of many problems often requires disjunctive, i.e. non-Horn rules in addition. There are approaches proposing such an extension of logic programming, but first and foremost they provide theoretical frameworks only. Here, we want to introduce a method which is also well-suited for implemen...
متن کاملPTTP+GLiDeS: Guiding Linear Deductions with Semantics
Using semantics to guide ATP systems is an under-utilised technique [10]. Two systems that have successfully employed semantic guidance are CLIN-S [1] and SCOTT [5]. In linear deduction, semantic guidance has received only limited attention, e.g., [7, 8]. Our research is developing semantic guidance for linear deduction in the Model Elimination (ME) [3] paradigm. Search pruning, at the possible...
متن کاملThe Need for Ancestor Resolution When Answering Queries in Horn Clause Logic
Prolog Technology Theorem Proving. (PTTP) [5] is a well known extension of Prolog for answering queries in first-order logic. PTTP is based on the idea that ‘Prolog can be viewed as an “almost complete” theorem prover, which has to be extended by only a few ingredients in order to handle the non-Horn case’ [1]. As explained in [5], PTTP is an efficient realisation of the Model Elimination (ME) ...
متن کامل